Impedance matching optimization of SiCf/Si3N4–SiOC composites for excellent microwave absorption properties

SiC fiber reinforced ceramic matrix composites (SiC_f-CMCs) are considered to be one of the most promising materials in the electromagnetic (EM) stealth of aero-engines, which is expected to achieve strong absorption and broad-band performance. Multiscale structural design was applied to SiC_f/Si₃N₄–SiOC composites by construction of micro/nanoscale heterogeneous interfaces and macro double-layer impedance matching structure. SiC_f/Si₃N₄–SiOC composites were fabricated by using SiC fibers with different conductivities and SiOC–Si₃N₄ matrices with gradient impedance structures to improve impedance matching effectively. Owing to its unique structure, SiC_f/Si₃N₄–SiOC composites (A3-composites) achieved excellent EM wave absorption performance with a minimum reflection coefficient (RC_min) of ?25.1 dB at 2.45 mm and an effective absorption bandwidth (EAB) of 4.0 GHz at 2.85 mm in X-band. Moreover, double-layer SiC_f/Si₃N₄–SiOC with an improved impedance matching structure obtained an RC_min of ?56.9 dB and an EAB of 4.2 GHz at 3.00 mm, which means it can absorb more than 90% of the EM waves in the whole X-band. The RC is less than ?8 dB at 2.6–2.8 mm from RT to 600 °C in the whole X-band, displaying excellent high-temperature absorption performance. The results provide a new design opinion for broad-band EM absorbing SiC_f-CMCs at high temperatures.     

Antenna selection for MIMO system based on pattern recognition

This paper proposes a novel Multiple-Input Multiple-Output (MIMO) transmission scheme based on Pattern Recognition (PR), which is termed as the PR aided Transmission Antenna Selection MIMO (PR-TAS aided MIMO). As the conventional TAS algorithms need to search all possible legitimate antenna subsets, they may impose some redundant calculations. In order to avoid this problem, we employ some pattern recognition methods to carry out the TAS algorithm in this paper. To be specific, two PR algorithms, namely the K-Nearest Neighbor (KNN) algorithm and the Support Vector Machine (SVM) algorithm, are introduced and redesigned to obtain a TAS with lower complexity but higher efficiency. Moreover, in order to improve the performance of the SVM, we propose a new feature extraction of channel matrix for the TAS. Our simulation results show that the proposed KNN and SVM based PR-TAS algorithms are capable of striking a flexible tradeoff between the complexity and the Bit Error Rate (BER), and the new feature can effectively improve the BER performance compared with the conventional feature extraction method.     

加权信息熵与增强局部二值模式结合的人脸识别

针对人脸识别因光照、姿态、表情、遮挡及噪声等多种因素的影响而导致的识别率不高的问题，提出一种加权信息熵（IEw）与自适应阈值环形局部二值模式（ATRLBP）算子相结合的人脸识别方法（IE （w） ATR-LBP）。首先，从原始人脸图像分块提取信息熵，得到每个子块的IEw；然后，利用ATRLBP算子分别对每个人脸子块提取特征从而得到概率直方图；最后，将各个块的IEw与概率直方图相乘，再串联成为原始人脸图像最后的特征直方图，并利用支持向量机（SVM）对人脸进行识别。在AR人脸库的表情、光照、遮挡A和遮挡B四个数据集上，IE （w） ATR-LBP方法分别取得了98.37%、94.17%、98.20%和99.34%的识别率。在ORL人脸库上，IE （w） ATR-LBP方法的最大识别率为99.85%；而且在ORL人脸库5次不同训练样本的实验中，与无噪声时相比，加入高斯和椒盐噪声后的平均识别率分别下降了14.04和2.95个百分点。实验结果表明，IE （w） ATR-LBP方法能够有效提高人脸在受光照、姿态、遮挡等影响时的识别率，尤其是存在表情变化及脉冲类噪声干扰时的识别率。     

A disruption recovery plan in a three-stage production-inventory system

This paper proposes a recovery plan for managing disruptions in a three-stage production-inventory system under a mixed production environment. First, a mathematical model is developed to deal with a disruption at any stage while maximizing total profit during the recovery-time window. The model is solved after the occurrence of a disruption event, with changed data used to generate a revised plan. We also propose a new and efficient heuristic for solving the developed mathematical model. Second, multiple disruptions are considered, where a new disruption may or may not affect the recovery plans of earlier disruptions. The heuristic, developed for a single disruption, is extended to deal with a series of disruptions so that it can be implemented for disruption recovery on a real-time basis. We compare the heuristic solutions with those obtained by a standard search algorithm for a set of randomly generated disruption test problems, and that show the consistent performance of our developed heuristic with lower computational times. Finally, some numerical examples and a real-world case study are presented to demonstrate the benefits and usefulness of our proposed approach.     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Affective matches of fabric and lighting chromaticity

This study investigates the impact of lighting colors on subjective judgments of fabric: in particular, whether the influence of lighting varies depending on fabric types and color combinations. We conducted two visual assessments. In Study 1 (N = 44), eight illuminants and six types of fabric were presented as cloth stimuli. Derived from the literature review, four sets of adjectives (humble-luxurious, cool-warm, old-new, and not preferred-preferred) were used as metrics. In Study 2 (N = 41), five sets of fabric color combination swatches were assessed under lighting conditions that were identical to those of Study 1. Three bipolar scales (ordinary-characterful, classic-modern, and soft-rigid), were employed from factor analysis along with three unipolar scales (luxurious, preferred, harmonious with lighting). The results showed that hue characteristics of lighting and cloth types influenced participants' perceptions of the fabric. Overall, white lighting with 4000 K was the most preferred and luxurious lighting across various types of clothes, while a pinkish white with 4700 K (duv = −0.0127) was the best matched in every color combination. In addition, there were interaction effects between lighting colors, clothes types, and fabric color combinations with regard to each of the perceptual qualities. This study provides empirical evidence for optimally match lighting colors with fabric in the presentation of fabric goods.     

Multi-Input Single Output SSSC based damping controller design by a hybrid Improved Differential Evolution-Pattern Search approach

In this paper, a hybrid Improved Differential Evolution and Pattern Search (hIDEPS) approach is proposed for the design of a PI-Type Multi-Input Single Output (MISO) Static Synchronous Series Compensator (SSSC) based damping controller. The improvement in Differential Evolution (DE) algorithm is introduced by a simple but effective scheme of changing two of its most important control parameters i.e. step size and crossover probability with an objective of achieving improved performance. Pattern Search (PS) is subsequently employed to fine tune the best solution provided by modified DE algorithm. The superiority of a proposed hIDEPS technique over DE and improved DE has also been demonstrated. At the outset, this concept is applied to a SSSC connected in a Single Machine Infinite Bus (SMIB) power system and then extended to a multi-machine power system. To show the effectiveness and robustness of the proposed design approach, simulation results are presented and compared with DE and Particle Swarm Optimization (PSO) optimized Single Input Single Output (SISO) SSSC based damping controllers. It is observed that the proposed approach yield superior damping performance compared to some approaches available in the literature.     

大数据环境下基于K中心点优化算法的Web服务组合

在当前Web服务海量增加、现有Web服务选择算法低效、用户匹配度差的基础上，针对K中心点算法存在的质点偏移、准确率低和容易发生畸变等问题，提出一种大数据环境下基于K中心点优化算法的Web服务组合方法。该方法是在大数据环境下，根据不同用户需求满意度及Web服务QoS参数，对基于优化初始聚类中心的K中心点算法的Web服务选择及最优Web服务组合进行研究。同时针对不同的选择方法对服务动态选择及组合的准确度、迭代更新次数、候选集选择时间及选择总时间进行实验分析，验证了本文研究方法的有效性和可靠性。     

工程教育认证背景下设计模式课程教学研究

工程教育是我国高等教育的重要组成部分,工程教育认证已成为中国高校新的风向标,也成为高考生选择报考专业的一项重要指标。设计模式是计算机科学与技术专业的一门核心课程,包含了面向对象的精髓,是软件体系结构的基础,在工程教育认证所评估的课程设置中起着承上启下的关键作用。本文基于工程教育专业认证理念,以及山东农业大学申请认证所用的《计算机科学与技术专业培养方案》,从教学内容、教学方式、课程目标与毕业要求对应关系、解决复杂工程问题能力、教学进度安排等方面,对设计模式课程开展了教学研究,并将该教学方案应用于本科教学。